- algorithm for arithmetic operation
- Вычислительная техника: алгоритм арифметической операции
Универсальный англо-русский словарь. Академик.ру. 2011.
algorithm for arithmetic operation
Смотреть что такое "algorithm for arithmetic operation" в других словарях:
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Algorithm examples — This article Algorithm examples supplements Algorithm and Algorithm characterizations. = An example: Algorithm specification of addition m+n =Choice of machine model:This problem has not been resolved by the mathematics community. There is no… … Wikipedia
Arithmetic complexity of the discrete Fourier transform — See Fast Fourier transform#Bounds on complexity and operation counts for a general summary of this issue.Bounds on the multiplicative complexity of FFTIn his PhD thesis in 1987 [1] , Michael Heidman focus on the arithmetic theory of complexity… … Wikipedia
Arithmetic logic unit — schematic symbol Cascadable 8 … Wikipedia
arithmetic — arithmetically, adv. n. /euh rith meuh tik/; adj. /ar ith met ik/, n. 1. the method or process of computation with figures: the most elementary branch of mathematics. 2. Also called higher arithmetic, theoretical arithmetic. the theory of… … Universalium
Algorithms for calculating variance — play a major role in statistical computing. A key problem in the design of good algorithms for this problem is that formulas for the variance may involve sums of squares, which can lead to numerical instability as well as to arithmetic overflow… … Wikipedia
Multiplication algorithm — A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are in use. Efficient multiplication algorithms have existed since the advent of the decimal system.… … Wikipedia
Affine arithmetic — (AA) is a model for self validated numerical analysis. In AA, the quantities of interest are represented as affine combinations (affine forms) of certain primitive variables, which stand for sources of uncertainty in the data or approximations… … Wikipedia
Elementary arithmetic — is the most basic kind of mathematics: it concerns the operations of addition, subtraction, multiplication, and division. Most people learn elementary arithmetic in elementary school.Elementary arithmetic starts with the natural numbers and the… … Wikipedia
Schönhage-Strassen algorithm — The Schönhage Strassen algorithm is an asymptotically fast multiplication algorithm for large integers. It was developed by Arnold Schönhage and Volker Strassen in 1971. [A. Schönhage and V. Strassen, Schnelle Multiplikation großer Zahlen ,… … Wikipedia
Split-radix FFT algorithm — The split radix FFT is a fast Fourier transform (FFT) algorithm for computing the discrete Fourier transform (DFT), and was first described in an obscure paper by R. Yavne (1968) and subsequently rediscovered simultaneously by various authors in… … Wikipedia
